Improving the Global Constraint SoftPrec
نویسندگان
چکیده
A soft global constraint SOFTPREC has been proposed recently for solving optimisation problems involving precedence relations. In this paper we present new pruning rules for this global constraint. We introduce a pruning rule that improves propagation from the objective variable to the decision variables, which is believed to be harder to achieve. We further introduce a pruning rule based on linear programming, and thereby make SOFTPREC a hybrid of constraint programming and linear programming. We present results demonstrating the efficiency of the pruning rules.
منابع مشابه
A Soft Global Precedence Constraint
Hard and soft precedence constraints play a key role in many application domains. In telecommunications, one application is the configuration of callcontrol feature subscriptions where the task is to sequence a set of user-selected features subject to a set of hard (catalogue) precedence constraints and a set of soft (user-selected) precedence constraints. When no such consistent sequence exist...
متن کاملImproving Success Ratio in Multi-Constraint Quality of Service Routing
Multi-constraint quality-of-service routing will become increasingly important as the Internet evolves to support real-time services. It is well known however, that optimum multi-constraint QoS routing is computationally complex, and for this reason various heuristics have been proposed for routing in practical situations. Among these methods, those that use a single mixed metric are the mo...
متن کاملImproving the quality of hospital services using the QFD approach and integration with kano analysis under budget constraint
Background and Objectives: One of the main concerns of hospital managers is their ability in improving their organization's performance. The use of quality management and decision-making techniques facilitates managers to achieve this goal. In this research, the corrective activities to increase the quality of hospital services are determined and selected using an integration o...
متن کاملA dynamic programming approach for solving nonlinear knapsack problems
Nonlinear Knapsack Problems (NKP) are the alternative formulation for the multiple-choice knapsack problems. A powerful approach for solving NKP is dynamic programming which may obtain the global op-timal solution even in the case of discrete solution space for these problems. Despite the power of this solu-tion approach, it computationally performs very slowly when the solution space of the pr...
متن کاملGlobal Optimization and Parallelization of Integrity Constraint Checks
In this paper we consider the problem of eeciently checking integrity constraints. We concentrate on a combination of two optimization techniques: global optimization and parallelization. The primary objective of global optimization is to produce a global execution plan for a group of constraints where common subexpressions can be shared. Since parallelism is a promising strategy for improving ...
متن کامل